Implementation Of ETL E-Commerce For Customer Clustering Using RFM And K-Means Clustering

نویسندگان

چکیده

E-commerce is the activity of selling and buying goods through an online system or online. One business models in which consumers sell products to other Customer (C2C) model. things that need be considered this model knowing level customer loyalty. By loyalty, company can provide several different treatments its customers so they maintain good relations with increase product purchase revenue. In study, author wants segment on data companies Brazil using K-Means clustering algorithm RFM (Recency, Frequency, Monetary) feature. There are also ETL stages research must carried out, namely taking from open public site (Kaggle), consist more than 9 tables (extract), then merging select some needs used (transform load), understanding by displaying it graphic form, conducting selection features / attributes. accordance proposed method, performs preprocessing, creates a get cluster. Based results has been done, number clusters 4 evaluation value silhouette score 0.470.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Customer Clustering using RFM analysis

RFM (Recency, Frequency, Monetary) analysis is a method to identify high-response customers in marketing promotions, and to improve overall response rates, which is well known and is widely applied today. Less widely understood is the value of applying RFM scoring to a customer database and measuring customer profitability. RFM analysis is considered significant also for the banks and their spe...

متن کامل

Clustering Analysis on E-commerce Transaction Based on K-means Clustering

Based on the density, increment and grid etc, shortcomings like the bad elasticity, weak handling ability of high-dimensional data, sensitive to time sequence of data, bad independence of parameters and weak handling ability of noise are usually existed in clustering algorithm when facing a large number of high-dimensional transaction data. Making experiments by sampling data samples of the 300...

متن کامل

Parallel Implementation of Genetic Algorithm using K-Means Clustering

-----------------------------------------------------------------ABSTRACT-------------------------------------------------------The existing clustering algorithm has a sequential execution of the data. The speed of the execution is very less and more time is taken for the execution of a single data. A new algorithm Parallel Implementation of Genetic Algorithm using KMeans Clustering (PIGAKM) is...

متن کامل

Cluster Analysis Using Rough Clustering and k-Means Clustering

IntroductIon Cluster analysis is a fundamental data reduction technique used in the physical and social sciences. It is of potential interest to managers in Information Science, as it can be used to identify user needs though segmenting users such as Web site visitors. In addition, the theory of Rough sets is the subject of intense interest in computational intelligence research. The extension ...

متن کامل

The k-means range algorithm for personalized data clustering in e-commerce

This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Ilmiah Merpati (Menara Penelitian Akademika Teknologi Informasi)

سال: 2022

ISSN: ['2252-3006', '2685-2411']

DOI: https://doi.org/10.24843/jim.2022.v10.i03.p05